Antipole Clustering for Fast Texture Synthesis
نویسندگان
چکیده
This paper describes a new method for analysis/synthesis of textures using a non-parametric multi-resolution approach able to reproduce efficiently the generative stochastic process of a wide class of real texture images. This is realized through a new data structure the Antipole Tree and a suitable research strategy able to outperform both the classical linear full-search heuristic and the TSVQ (Tree Structure Vector Quantization) acceleration used in previous related works. Experimental results performed on an exhaustive set of textures [VisTex] show the effectiveness of the proposed approach.
منابع مشابه
Fast Clustering and Minimum Weight Matching Algorithms for Very Large Mobile Backbone Wireless Networks
Mobile Backbone Wireless Networks (MBWN) [10] are wireless networks in which the base stations are mobile. Our strategy is the following: mobile nodes are dynamically grouped into clusters of bounded radius. In the very large wireless networks we deal with we deal with, several hundreds of clusters may be generated. Clustering makes use of a two dimensional Euclidean version of the Antipole Tre...
متن کاملSmart Ideas for Photomosaic Rendering
Photomosaic is a technique which transforms an input image into a rectangular grid of thumbnail images preserving the overall appearance. The typical photomosaic algorithm searches from a large database of images one picture that approximates a block of pixels in the main image. Since the quality of the output depends on the size of the database, it turns out that the bottleneck in each photomo...
متن کاملFast Estimation of Nonparametric Kernel Density Through PDDP, and its Application in Texture Synthesis
In thiswork, anewalgorithm isproposed for fast estimationofnonparametricmultivariate kernel density, based on principal direction divisive partitioning (PDDP) of the data space.The goal of the proposed algorithm is to use the finite support property of kernels for fast estimation of density. Compared to earlier approaches, this work explains the need of using boundaries (for partitioning the sp...
متن کاملContent Based Image Indexing and Retrieval
In this paper, we present the efficient content based image retrieval systems which employ the color, texture and shape information of images to facilitate the retrieval process. For efficient feature extraction, we extract the color, texture and shape feature of images automatically using edge detection which is widely used in signal processing and image compression. For facilitated the speedy...
متن کاملA Roller - Fast Sampling-Based Texture Synthesis Algorithm
This paper describes a method for synthesizing natural textures that realistically matches given colour texture appearance. The novel texture synthesis method, which we call the roller, is based on the overlapping tiling and subsequent minimum error boundary cut. An optimal double toroidal patch is seamlessly repeated during the synthesis step. While the method allows only moderate texture comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003